Justicia: A Stochastic SAT Approach to Formally Verify Fairness

A Stochastic Limit Approach to the SAT Problem

There exists an important problem whether there exists an algorithm to solve an NP-complete problem in polynomial time. In this paper, a new concept of quantum adaptive stochastic systems is proposed, and it is shown that it can be used to solve the problem above.

Industrial-Strength Formally Certified SAT Solving

Boolean Satisfiability (SAT) solvers are now routinely used in the verification of large industrial problems. However, their application in safety-critical domains such as the railways, avionics, and automotive industries requires some form of assurance for the results, as the solvers can (and sometimes do) have bugs. Unfortunately, the complexity of modern, highly optimized SAT solvers renders...

A Discrete Stochastic Approach to Hotel Revenue Management

  A linear programming model has been presented for finding an appropriate planning in order to maximize hotel revenue. In this model, a special planning horizon has been considered that includes several busy days of a year. There are several reservation periods that may start a few months earlier. Each period of reservation may have different prices and so result different incomes. Hotel custo...

A SAT Approach to Branchwidth

Branch decomposition is a prominent method for structurally decomposing a graph, hypergraph or CNF formula. The width of a branch decomposition provides a measure of how well the object is decomposed. For many applications it is crucial to compute a branch decomposition whose width is as small as possible. We propose a SAT approach to finding branch decompositions of small width. The core of ou...

SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems